Search results for "binary [neutron star]"
showing 10 items of 544 documents
On prefix normal words and prefix normal forms
2016
A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of $1$s and $0$s (a given Parikh vector). Each binary word has an associated set of Parikh vectors of the factors of the word. Using prefix normal words, we provide a characterization of the equivalence class of binary words having the same set of Parikh vectors of their factors. We prove that the language of prefix normal words is not context-free and is strictly contai…
Probabilistic Memristive Networks: Application of a Master Equation to Networks of Binary ReRAM cells
2020
Abstract The possibility of using non-deterministic circuit components has been gaining significant attention in recent years. The modeling and simulation of their circuits require novel approaches, as now the state of a circuit at an arbitrary moment in time cannot be predicted deterministically. Generally, these circuits should be described in terms of probabilities, the circuit variables should be calculated on average, and correlation functions should be used to explore interrelations among the variables. In this paper, we use, for the first time, a master equation to analyze the networks composed of probabilistic binary memristors. Analytical solutions of the master equation for the ca…
Microstructure reconstruction using entropic descriptors
2009
A multi-scale approach to the inverse reconstruction of a pattern's microstructure is reported. Instead of a correlation function, a pair of entropic descriptors (EDs) is proposed for stochastic optimization method. The first of them measures a spatial inhomogeneity, for a binary pattern, or compositional one, for a greyscale image. The second one quantifies a spatial or compositional statistical complexity. The EDs reveal structural information that is dissimilar, at least in part, to that given by correlation functions at almost all of discrete length scales. The method is tested on a few digitized binary and greyscale images. In each of the cases, the persuasive reconstruction of the mic…
Binary jumbled string matching for highly run-length compressible texts
2012
The Binary Jumbled String Matching problem is defined as: Given a string $s$ over $\{a,b\}$ of length $n$ and a query $(x,y)$, with $x,y$ non-negative integers, decide whether $s$ has a substring $t$ with exactly $x$ $a$'s and $y$ $b$'s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this index have running time $O(n^2/\log n)$ [Burcsi et al., FUN 2010; Moosa and Rahman, IPL 2010], or $O(n^2/\log^2 n)$ in the word-RAM model [Moosa and Rahman, JDA 2012]. We propose an index constructed directly from the run-length encoding of $s$. The construction time of our index i…
A dynamic program analysis to find floating-point accuracy problems
2012
Programs using floating-point arithmetic are prone to accuracy problems caused by rounding and catastrophic cancellation. These phenomena provoke bugs that are notoriously hard to track down: the program does not necessarily crash and the results are not necessarily obviously wrong, but often subtly inaccurate. Further use of these values can lead to catastrophic errors.In this paper, we present a dynamic program analysis that supports the programmer in finding accuracy problems. Our analysis uses binary translation to perform every floating-point computation side by side in higher precision. Furthermore, we use a lightweight slicing approach to track the evolution of errors.We evaluate our…
Viscosity Arrhenius parameters correlation: extension from pure to binary fluid mixtures
2015
Knowledge of fluids’ physicochemical properties is mandatory for the design and optimisation of industrial processes and products. A data quantity of most importance, in this regard, turns out to be the value of fluid viscosity. Many empirical and semi-empirical formulas have been proposed in the literature to describe the viscosity of pure liquids and binary liquid mixtures. Recently, an interesting equation is proposed for pure solvents correlating the two parameters in the viscosity Arrhenius-type equation, namely the activation energy (Ea) and the pre-exponential factor (As). This paper aims to extend the said correlation to binary liquid mixtures. To achieve this purpose, statistical m…
Identification and Robust Control of a Quadratic DC/DC Boost Converter by Hammerstein Model
2015
This paper deals with the theoretical framework definition and the experimental application of the Hammerstein (HM) identification and related robust control technique to a quadratic dc/dc single-switch boost (Q-boost) converter. A set of fourth-order transfer functions (TFs) has been identified with the Hammerstein approach, on the basis of a pseudorandom-binary-sequence (PRBS) excitation signal. The set of identified TFs has been then used to design a suitable robust control technique, able to properly deal with the converter parameter uncertainty and load variations. The proposed approach has been tested in numerical simulation and validated experimentally on a suitably developed test se…
Derivation of Models for Thin Sprays from a Multiphase Boltzmann Model
2017
We shall review the validation of a class of models for thin sprays where a Vlasov type equation is coupled to an hydrodynamic equation of Navier–Stokes or Stokes type. We present a formal derivation of these models from a multiphase Boltzmann system for a binary mixture: under suitable assumptions on the collision kernels and in appropriate asymptotics (resp. for the two different limit models), we prove the convergence of solutions to the multiphase Boltzmann model to distributional solutions to the Vlasov–Navier–Stokes or Vlasov–Stokes system. The proofs are based on the procedure followed in Bardos et al. (J Stat Phys 63:323–344 (1991), [2]) and explicit evaluations of the coupling term…
On the relative sizes of learnable sets
1998
Abstract Measure and category (or rather, their recursion-theoretical counterparts) have been used in theoretical computer science to make precise the intuitive notion “for most of the recursive sets”. We use the notions of effective measure and category to discuss the relative sizes of inferrible sets, and their complements. We find that inferable sets become large rather quickly in the standard hierarchies of learnability. On the other hand, the complements of the learnable sets are all large.
The pruning-grafting lattice of binary trees
2008
AbstractWe introduce a new lattice structure Bn on binary trees of size n. We exhibit efficient algorithms for computing meet and join of two binary trees and give several properties of this lattice. More precisely, we prove that the length of a longest (resp. shortest) path between 0 and 1 in Bn equals to the Eulerian numbers 2n−(n+1) (resp. (n−1)2) and that the number of coverings is (2nn−1). Finally, we exhibit a matching in a constructive way. Then we propose some open problems about this new structure.